A generalized enumeration of labeled trees and reverse Prüfer algorithm
نویسندگان
چکیده
منابع مشابه
A generalized enumeration of labeled trees and reverse Prüfer algorithm
A leader of a tree T on [n] is a vertex which has no smaller descendants in T . Gessel and Seo showed that ∑ T ∈Tn u(# of leaders in T )c(degree of 1 in T ) = uPn−1(1, u, cu), which is a generalization of Cayley’s formula, where Tn is the set of trees on [n] and Pn(a, b, c)= c n−1 ∏ i=1 ( ia + (n− i)b+ c. Using a variation of the Prüfer code which is called a RP-code, we give a simple bijective...
متن کاملA Combinatorial Proof of Postnikov's Identity and a Generalized Enumeration of Labeled Trees
In this paper, we give a simple combinatorial explanation of a formula of A. Postnikov relating bicolored rooted trees to bicolored binary trees. We also present generalized formulas for the number of labeled k-ary trees, rooted labeled trees, and labeled plane trees.
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملA bijective enumeration of labeled trees with given indegree sequence
For a labeled tree on the vertex set {1, 2, . . . , n}, the local direction of each edge (i j) is from i to j if i < j. For a rooted tree, there is also a natural global direction of edges towards the root. The number of edges pointing to a vertex is called its indegree. Thus the local (resp. global) indegree sequence λ = 1e2e . . . of a tree on the vertex set {1, 2, . . . , n} is a partition o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2007
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2007.01.010